PScheD: Political Scheduling on the CRAY T3E
نویسندگان
چکیده
Large parallel processing environments present serious administrative challenges if high utilization of the available resources is a goal. In many cases there is also the need to support critical or time-dependent applications at the same time as development and routine production work is going on. This paper describes the components that help realize the Political Scheduling goals of the CRAY T3E system. The meaning of Political Scheduling is de-ned, we present a general overview of the Cray T3E hardware and operating system and describe the current implementation of the Political Scheduling feature of Unicos/mk.
منابع مشابه
Lachesis: A Job Scheduler for the Cray T3E
This paper presents the design and implementation of Lach-esis, a job scheduler for the Cray T3E. Lachesis was developed at the San Diego Supercomputer Center (SDSC) in an attempt to correct some problems with the scheduling system Cray provides with the T3E.
متن کاملSystem Utilization Benchmark on the Cray T3E and IBM SP
Obtaining maximum utilization of parallel systems continues to be an active area of research and development. This article outlines a new benchmark, called the Eflectiwe System Performance (ESP) test, designed to provide a utilization metric that is transferable between systems and illuminate the effects of various scheduling parameters. Results with discussion are presented for the Cray T3E an...
متن کاملParallel Multiplication of a Vector by a Kronecker Product of Matrices (Part II)
The paper provides a generalization of our previous algorithm for the parallel multiplication of a vector by a Kronecker product of matrices. For any p, a factor of the problem size, our algorithm runs on p processors with a minimum number of communication steps and memory space. Specifically, on p processors with global communication, we show that the multiplication requires at least Θ(log(p))...
متن کاملNetwork Simulation on Cray-T3E using MPI
We propose a novel approach for parallel discrete-event network simulation on packet-switched, point-to-point networks. Our algorithm resolves packet connicts through priority sorting of appropriate integer connict functions. We implement our method on CM-5, Cray-T3D, and Cray-T3E systems using C and MPI, and perform critical optimizations aimed at reducing sorting overhead, minimizing inter-pr...
متن کامل